منابع مشابه
Constructing Optimal Golomb Rulers in Parallel
In this paper, a construction of the Golomb optimal rulers is studied with a tree search approach. Improvements to the basic algorithm are given and it is parallelized using a shared memory. The application associated to this approach is written in C using the standard OpenMP and MPI libraries. The algorithm takes advantage of a collaboration mechanism between the processors. Different load bal...
متن کاملGolomb Rulers
The Math Factor podcast posed the problem of finding the smallest number of inch marks on a 12 inch ruler so that one could still measure any integer length from 1 to 12. One needs only four additional marks besides 0 and 12; for example 1, 4, 7, 10 works. This entertaining problem lead to others during the next few minutes (you can listen at mathfactor.uark.edu/2005/10) and inspired us to look...
متن کاملOn Disjoint Golomb Rulers
A set {ai | 1 ≤ i ≤ k} of non-negative integers is a Golomb ruler if differences ai − aj , for any i 6= j, are all distinct. A set of I disjoint Golomb rulers (DGR) each being a J-subset of {1, 2, · · · , n} is called an (I, J, n) − DGR. Let H(I, J) be the least positive n such that there is an (I, J, n) − DGR. In this paper, we propose a series of conjectures on the constructions and structure...
متن کاملEvolving Golomb Rulers
A Golomb Ruler is defined as a ruler that has marks unevenly spaced at integer locations in such a way that the distance between any two marks is unique. Unlike usual rulers, they have the ability to measure more discrete measures than the number of marks they possess. Although the definition of a Golomb Ruler does not place any restriction on the length of the ruler, researchers are usually in...
متن کاملSome new optimum Golomb rulers
0 Theorem 4, unlike Theorem 2, is not a s'pecial case of a known general result: it is not known if the statement of Theorem 4 holds for twoaccess channels that are not pairwise reversible. There is a converse to Theorem 4: For any fixed rate strictly inside R o , there exists a code with that rate for which X I 1 + o(N). This result holds for general twoaccess channels, and is proved by random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3075877